Epistemic Actions as Resources

نویسندگان

  • Alexandru Baltag
  • Bob Coecke
  • Mehrnoosh Sadrzadeh
چکیده

We provide algebraic semantics together with a sound and complete sequent calculus for information update due to epistemic actions. This semantics is flexible enough to accommodate incomplete as well as wrong information e.g. due to secrecy and deceit, as well as nested knowledge. We give a purely algebraic treatment of the muddy children puzzle, which moreover extends to situations where the children are allowed to lie and cheat. Epistemic actions, that is, information exchanges between agents A,B, . . . ∈ A, are modeled as elements of a quantale. The quantale (Q, ∨ , •) acts on an underlyingQ-right module (M, ∨ ) of epistemic propositions and facts. The epistemic content is encoded by appearance maps, one pair f A : M → M and f Q A : Q → Q of (lax) morphisms for each agent A ∈ A, which preserve the module and quantale structure respectively. By adjunction, they give rise to epistemic modalities [12], capturing the agents’ knowledge on propositions and actions. The module action is epistemic update and gives rise to dynamic modalities [21]— cf.weakest precondition. This model subsumes the crucial fragment of Baltag, Moss and Solecki’s [6] dynamic epistemic logic, abstracting it in a constructive fashion while introducing resource-sensitive structure on the epistemic actions.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Reasoning about Dynamic Epistemic Logic

We present an algebra and sequent calculus to reason about dynamic epistemic logic, a logic for information update in multi-agent systems. We contribute to it by equipping it with a logical account of resources, a semi-automatic way of reasoning through the algebra and sequent calculus, and finally by generalizing it to non-boolean settings. Dynamic Epistemic Logic (DEL) is a PDL-style logic [1...

متن کامل

ar X iv : m at h / 06 08 16 6 v 1 [ m at h . L O ] 7 A ug 2 00 6 Epistemic actions as resources

We provide algebraic semantics together with a sound and complete sequent calculus for information update due to epistemic actions. This semantics is flexible enough to accommodate incomplete as well as wrong information e.g. deceit. We give a purely algebraic treatment of the muddy children puzzle, which moreover extends to situations where the children are allowed to lie and cheat. Epistemic ...

متن کامل

Algebra and Sequent Calculus for Epistemic Actions

We introduce an algebraic approach to Dynamic Epistemic Logic. This approach has the advantage that: (i) its semantics is a transparent algebraic object with a minimal set of primitives from which most ingredients of Dynamic Epistemic Logic arise, (ii) it goes with the introduction of non-determinism, (iii) it naturally extends beyond boolean sets of propositions, up to intuitionistic and non-d...

متن کامل

An Algebraic Approach to Dynamic Epistemic Logic

Dynamic epistemic logic plays a key role in reasoning about multi-agent systems. Past approaches to dynamic epistemic logic have typically been focused on actions whose primary purpose is to communicate information from one agent to another. These actions are unable to alter the valuation of any proposition within the system. In fields such as security, it is easy to imagine situations in which...

متن کامل

What baboons, babies and Tetris players tell us about interaction: a biosocial view of norm-based social learning

Could androids use movements to build relationships? For people, relationships are created with the help of behaviour-shaping norms,which infants begin to discover andmanipulate by the thirdmonth.To build relationships, machines can also learn to exploit human reactions in real-time decision-making. In the video gameTetris, for example, affect co-opts computer-generated patterns to simplify cog...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. Log. Comput.

دوره 17  شماره 

صفحات  -

تاریخ انتشار 2007